Computing Disparity on Demand: Disparity based Classification using Error-Tolerant Decision Tree Ensembles
نویسندگان
چکیده
Most range-based recognition systems require the calculation of a full disparity map at adequate resolutions prior to the recognition step. There also exist range-based systems that only require the computation of a sparse disparity map. We introduce a 3D shape classification method in which the disparity calculation is guided by the needs of the classification process. The method uses decision trees for shape classification and calculates the disparity only at certain locations in the image, as required by the tree structure. The calculation is very efficient as only the minimum number of disparity values are calculated. To render the classification robust, we use an ensemble of trees. The proposed ensemble method is different from the currently known ensemble methods and makes the classification system more robust to errors in the disparity calculation. The method was applied to a real world problem and good classification results were obtained.
منابع مشابه
Comparison of Decision Tree and Naïve Bayes Methods in Classification of Researcher’s Cognitive Styles in Academic Environment
In today world of internet, it is important to feedback the users based on what they demand. Moreover, one of the important tasks in data mining is classification. Today, there are several classification techniques in order to solve the classification problems like Genetic Algorithm, Decision Tree, Bayesian and others. In this article, it is attempted to classify researchers to “Expert” and “No...
متن کاملComparison of Decision Tree and Naïve Bayes Methods in Classification of Researcher’s Cognitive Styles in Academic Environment
In today world of internet, it is important to feedback the users based on what they demand. Moreover, one of the important tasks in data mining is classification. Today, there are several classification techniques in order to solve the classification problems like Genetic Algorithm, Decision Tree, Bayesian and others. In this article, it is attempted to classify researchers to “Expert” and “No...
متن کاملFast Non-local Stereo Matching based on Hierarchical Disparity Prediction
Stereo matching is the key step in estimating depth from two or more images. Recently, some tree-based non-local stereo matching methods [22, 12] have been proposed, which achieved state-of-the-art performance. The algorithms employed some tree-structures to aggregate cost and thus improved the performance and reduced the coputation load of the stereo matching. However, the computational comple...
متن کاملFault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کامل